Halpern's Iteration in CAT(0) Spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New iteration process for approximating fixed points in Banach spaces

‎The object of this paper is to present a new iteration process‎. ‎We will show that our process is faster than the known recent iterative schemes‎. ‎We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings‎. ‎We also present a numerical example for proving the rate of convergence of our res...

متن کامل

Strong convergence of modified noor iteration in CAT(0) spaces

We prove a strong convergence theorem for the modified Noor iterations‎ ‎in the framework of CAT(0) spaces‎. ‎Our results extend and improve the corresponding results of‎ ‎X‎. ‎Qin‎, ‎Y‎. ‎Su and M‎. ‎Shang‎, ‎T‎. ‎H‎. ‎Kim and H‎. ‎K‎. ‎Xu and S‎. ‎Saejung‎ ‎and some others‎.

متن کامل

On the Ishikawa iteration process in CAT(0) spaces

In this paper, several $Delta$ and strong convergence theorems are established for the Ishikawa iterations for nonexpansive mappings in the framework of CAT(0) spaces. Our results extend and improve the corresponding results

متن کامل

Halpern’s Iteration in CAT(0) Spaces

Let X, d be a metric space and x, y ∈ X with l d x, y . A geodesic path from x to y is an isometry c : 0, l → X such that c 0 x and c l y. The image of a geodesic path is called a geodesic segment. A metric spaceX is a (uniquely) geodesic space if every two points ofX are joined by only one geodesic segment. A geodesic triangle x1, x2, x3 in a geodesic space X consists of three points x1, x2, x...

متن کامل

Multilevel Blocking in Complex Iteration Spaces

This paper presents a new unified method for simultaneously tiling the register and cache levels of the memory hierarchy. We will focus on the code transformation phase of tiling. Our algorithm uses strip-mining and loop interchange on all memory hierarchy levels to determine the tiles as usual, and, afterwards, and due to the special characteristics of the register level, we apply index set sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fixed Point Theory and Applications

سال: 2010

ISSN: 1687-1820,1687-1812

DOI: 10.1155/2010/471781